- Some Studies on Fuzzy Finite Automata
关于模糊有限自动机若干问题的研究 - The existing methods of minimizing fuzzy finite automata do not discuss the transfer and change of the grade of fuzzy automata, but the problem is solved in the optimized method.
现有的模糊自动机最小化算法没有涉及到对模糊自动机状态的隶属度迁移和变化的讨论，优化的模糊自动机最小化算法弥补了这类算法的不足之处。 - Invertibility of finite automata with quasi-( h, k)-order memory
拟（h，k）存贮有限自动机的可逆性 - In language theory, the simplest algorithms are those which can be implemented by finite automata, the subject of this algorithm implement simplest book.
在语言理论，最简单的一类算法就是可以用有限自动机实理论可以算法现的算法，也是本书的主题。 - Research on Characterizations and Products of Two Kinds of Nonclassical Finite Automata
两类非经典有限自动机的性质与乘积研究 - A Proofreading Algorithm of Mongolian Text Based on Nondeterministic Finite Automata
基于不确定有限自动机的蒙古文校对算法确定型有穷自动机状态极小化的研究 - Equivalence of Fuzzy Finite Automata Based on Computing with Words
基于词计算的Fuzzy有限自动机的等价问题 - A Method for Path Coverage Testing Based on Deterministic Finite Automata Machine
基于有穷自动机的路径覆盖测试方法 - Learning of Deterministic Finite Automata at Exact Learning Model
精确学习模型下确定的有穷自动机的学习 - Complexity of finite automata
有限自动机的复杂性 - Modeling and Analysis for "Dots and Boxes" Computer Game System Based on Finite Automata
基于有限自动机的点点连格机器博弈系统的建模与分析 - Finite Automata Minimization Based on Equivalence Relation
基于等价关系的有穷自动机最小化方法 - Implementation of an Artificial Emotion Model and Behavior Strategies Based on Finite Automata
一种人工情感及行为策略模型的有限自动机实现 - Three Kinds of Linear Finite Automata's Linear τ-weak Invertibility
三种线性有限自动机的线性τ-弱逆 - Discussion of Finite Automata Based on Algebraic Theory of Semirings
基于半环代数理论的有限自动机的探讨 - Introduction, Finite Automata, Regular Expressions.
简介，有限自动机，正则运算式。 - The theory of finite automata is the mathematical theory of a simple class of algorithms that are important in computer science.
有限自动机理论是一类简单类算法的数学理论，这些算法理论这些数学虽然简单但对计算机科学很重要。 - Minimization of Mealy Lattice Finite Automata Based on Fuzzy Strings
基于模糊字符串的Mealy格值有限自动机及其最小化 - Two results about the decomposition of delay step of weakly invertible finite automata
关于弱可逆有限自动机延迟步数分解的两个结果 - It is very important to investigate the decomposition of weakly invertible finite automata, since it could provide an approach to cryptanalyzing finite automata public-key cryptosystem ( FAPKC).
研究弱可逆有限自动机的分解可以为分析有限自动机公开钥密码体制的安全性提供一种重要途径。 - State machine theory is a research direction of finite automata theory.
状态机理论是有限自动机理论的一个研究方向。 - The highway toll collector system was researched by using the finite automata theory.
利用有穷自动机理论研究了高速公路收费站的收费系统。 - The system includes a extended finite automata and heuristic search technique.
在该系统中，使用了扩充的有限自动机和启发式搜索等技术。 - In this paper, we suggest an approach to compress image using Deterministic Finite Automata ( DFA).
本文提出用确定性的有限自动机（DFA）进行图像压缩编码的方法。 - This paper is concerned with the classification of fuzzy finite automata and the minimization algorithm of fuzzy finite automata.
本文研究了模糊有限自动机的分类和模糊有限自动机的状态最小化算法。 - The paper discusses the technique and algorithms of intrusion detection based on the protocol analysis, and presents a protocol state transfer model according finite automata.
本文对协议分析入侵检测的方法和算法进行了研究，并通过对网络协议和入侵攻击的深入分析，提出了一个基于有穷状态机的状态协议迁移模型。 - The concept of composition of finite automata is first proposed in finite automaton public key cryptosystem.
在有限自动机公开钥密码体制中首次提出了自动机化合的概念。 - For mobile electronic commerce protocols, a modeling method based on finite automata is proposed.
针对移动电子商务协议，提出了一种基于有限状态机的建模方法； - We make some technical improvements based on the Benenson DNA finite automata model.
本文在Benenson提出的DNA有限状态自动机模型的基础上做了一些技术上的改进。